Epistemic GDL: A logic for representing and reasoning about imperfect information games

This paper proposes a logical framework for representing and reasoning about imperfect information games. We first extend Game Description Language (GDL) with the standard epistemic operators provide it semantics based on state transition model. then demonstrate how to use language represent rules of an game formalize common properties as well properties. also show reason players' own each others' knowledge during playing. Furthermore, we prove that model-checking problem is in Δ2P, even though its lower bound Θ2P. These results indicate makes good balance between expressive power computational efficiency. Finally sound complete axiomatic system this logic. With action, temporal operators, completeness proof requires novel combination techniques used dynamic logic logics. The theory provides feasible tool analyze family